Denotational Semantics of XML-Lambda
نویسندگان
چکیده
The article deals with the denotational semantics of a special query language called XML-Lambda, which is based on the simply typed lambda calculus. Such semantics allows experimentation with a language definition, prototyping of programs, and similar experiments.
منابع مشابه
On the denotational semantics of XML-Lambda
The article deals with the denotational semantics of a special query language called XML-Lambda (abbreviated as XML-λ), which is based on the simply typed lambda calculus. The exact semantics allows experimentation with a language definition, prototyping of programs, and similar experiments. One of such experiment is the implementation of the XQuery language in the XML-λ environment. The main a...
متن کاملDenotational Semantics of the XML-lambda Query Language
In this paper, we define formally the XML-λ Query Language, a query language for XML, that employs the functional data model. We describe its fundamental principles including the abstract syntax and denotational semantics. The paper basically aims for outlining of the language scope and capabilities.
متن کاملEvaluation of XPath Fragments Using Lambda Calculi
XML Path Language (XPath) is the most important standard for navigation within XML documents nowadays. In this paper we present the state of our current research that is focused on using a functional framework based on simply typed lambda calculi and a general type system XML-λ for description of semantics of a query language. With such formalism we are able to describe the semantics of all lan...
متن کاملIncremental Lambda Lifting: an Exercise in Almost-denotational Semantics
We prove the correctness of incremental lambda-lifting, an optimization that attempts to reduce the closure allocation overhead of higher-order programs by changing the scope of nested procedures. This optimization is invalid in the standard denotational semantics of Scheme, because it changes the storage behavior of the program. Our method consists of giving Scheme a denotational semantics in ...
متن کاملDenotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus.
متن کامل